The Properties and Fast Algorithm of Quaternion Linear Canonical Transform
نویسندگان
چکیده
منابع مشابه
Polar Linear Canonical Transform in Quaternion Domain
Nowadays, almost all images acquired are in color format. Traditional methods process color images by either transforming them into gray scale or dividing them into red, green, and blue components for independent processing, which is definitely not effective in representing color information. Recently, a novel Polar Linear Canonical Transform (PLCT) with parameters in SL(2,<) has been reported,...
متن کاملA fast algorithm for the linear canonical transform
In recent years there has been a renewed interest in finding fast algorithms to compute accurately the linear canonical transform (LCT) of a given function. This is driven by the large number of applications of the LCT in optics and signal processing. The well-known integral transforms: Fourier, fractional Fourier, bilateral Laplace and Fresnel transforms are special cases of the LCT. In this p...
متن کاملFast numerical algorithm for the linear canonical transform.
The linear canonical transform (LCT) describes the effect of any quadratic phase system (QPS) on an input optical wave field. Special cases of the LCT include the fractional Fourier transform (FRT), the Fourier transform (FT), and the Fresnel transform (FST) describing free-space propagation. Currently there are numerous efficient algorithms used (for purposes of numerical simulation in the are...
متن کاملSampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کامل2-D Left-Side Quaternion Discrete Fourier Transform: Fast Algorithm
We describe a fast algorithm for the 2-D left-side QDFT which is based on the concept of the tensor representation when the color or four-componnrnt quaternion image is described by a set of 1-D quaternion signals and the 1-D left-side QDFTs over these signals determine values of the 2-D left-side QDFT at corresponding subset of frequency-points. The efficiency of the tensor algorithm for calcu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Signal and Information Processing
سال: 2018
ISSN: 2159-4465,2159-4481
DOI: 10.4236/jsip.2018.93012